Universality in effective strings

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universality in Effective Strings

We demonstrate that, due to the finite thickness of domain walls, and the consequent ambiguity in defining their locations, the effective string description obtained by integrating out bulk degrees of freedom contains ambiguities in the coefficients of the various geometric terms. The only term with unambiguous coefficient is the zeroth order Nambu-Goto term. We argue that fermionic ghost field...

متن کامل

Universality Class of Confining Strings

A recently proposed model of confining strings has a non-local world-sheet action induced by a space-time Kalb-Ramond tensor field. Here we show that, in the large-D approximation, an infinite set of ghostand tachyon-free truncations of the derivative expansion of this action all lead to c = 1 models. Their infrared limit describes smooth strings with world-sheets of Hausdorff dimension DH = 2 ...

متن کامل

Quantizing Effective Strings

This talk reviewed the theory of effective strings, with particular emphasis on the manner in which Lorentz invariance is represented. The quantum properties of an example of an effective string are derived from the underlying field theory. A comparison is made with what one would expect if one assumed that quantum effective strings were governed by fundamental string actions such as the Nambu-...

متن کامل

Lorentz invariance of effective strings

Starting from a Poincaré invariant field theory of a real scalar field with interactions governed by a double-well potential in 2+1 dimensions, the Lorentz representation induced on the collective coordinates describing low-energy excitations about an effective string background is derived. In this representation, Lorentz transformations are given in terms of an infinite series, in powers of de...

متن کامل

The universality of iterated hashing over variable-length strings

Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3wise independent. We show that it can be almost universal over strings much longer than the number of hash values; we bound the maximal string le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Experimental and Theoretical Physics Letters

سال: 1999

ISSN: 0021-3640,1090-6487

DOI: 10.1134/1.568059